Ontology Mapping Validation: Dealing with an NP-Complete Problem
نویسندگان
چکیده
The use of ontologies and ontology mappings is increasing in companies. Often the same context is modeled in different ontologies. Mapping is necessary to integrate these ontologies; however, in many cases these mappings are incorrect, i.e., they incorrectly link semantic concepts with different meanings. Tools that validate these mappings are necessary to ensure reliable communication between heterogeneous systems. This validation cannot be done in a completely automatic way, because the mappings are based on human interpretation. This work describes a semi-automatic tool that supports this activity, based on graphs that generate instances validated in a semi-automatic process that aims to ensure mapping robustness. This algorithm deals with an NP-Complete problem in order to generate all the instances. This paper presents a first prototype of the tool and the methodology used to validate the instances automatically generated by the tool.
منابع مشابه
An ontological hybrid recommender system for dealing with cold start problem
Recommender Systems ( ) are expected to suggest the accurate goods to the consumers. Cold start is the most important challenge for RSs. Recent hybrid s combine and . We introduce an ontological hybrid RS where the ontology has been employed in its part while improving the ontology structure by its part. In this paper, a new hybrid approach is proposed based on the combination of demog...
متن کاملReconfigurable Architectures for Mixed-Initiative Planning and Scheduling
This thesis addresses the problem of building software applications for planning and scheduling systems. Most planning and scheduling problems are NP-complete even for simpli ed formulations. The practical utilization of planning and scheduling systems as decision support tools requires not only dealing with this computational complexity in a reasonable way but also considering the uncertaintie...
متن کاملOntology Evolution in Data Integration1
Ontologies are becoming more and more important in data integration. An important problem when dealing with ontologies is the fact that they are living artefacts and subject to change. When ontologies evolve, the changes should somehow be rendered and used by the pre-existing data integration systems. In most of these systems, when ontologies change their relations with the data sources i.e. th...
متن کاملA Knowledge Base on Np-complete Decision Problems and Its Application in Bibliographic Search
NP-complete decision problems are one of the most important subjects in computer science. We have developed a knowledge base of NP-complete decision problems that reflects the conceptual knowledge and the relationships of more than 350 decision problems including additional information resources such as bibliographic references or author information. The knowledge base is applied by the web bas...
متن کاملPreprocessing for Invariant Validation
Hoare's logic and Dijkstra's predicate transformer calculus have proved adequate for reducing the correctness problem for programs to the validity problem for logical formulas. However, the size of the logical formulas to be validated grows faster than the size of the program , and, even in the propositional case, the validation problem is NP-complete and becomes practically intractable for lar...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IJWP
دوره 3 شماره
صفحات -
تاریخ انتشار 2011